Evidence-invariant Sensitivity Bounds
نویسندگان
چکیده
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is performed a number of times, with different evidence. Although efficient algorithms for sensitivity analysis exist, a complete analysis is often infeasible because of the large range of possible combinations of observations. In this paper we present a method for studying sensitivities that are invariant to the evidence entered. Our method builds upon the idea of establishing bounds between which a parameter can be varied without ever inducing a change in the most likely value of a variable of interest.
منابع مشابه
Perturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کاملInvariant elements in the dual Steenrod algebra
In this paper, we investigate the invariant elements of the dual mod $p$ Steenrod subalgebra ${mathcal{A}_p}^*$ under the conjugation map $chi$ and give bounds on the dimensions of $(chi-1)({mathcal{A}_p}^*)_d$, where $({mathcal{A}_p}^*)_d$ is the dimension of ${mathcal{A}_p}^*$ in degree $d$.
متن کاملBounded invariant verification for time-delayed nonlinear networked dynamical systems
We present a technique for bounded invariant verification of nonlinear networked dynamical systems with delayed interconnections. The underlying problem in precise boundedtime verification lieswith computing bounds on the sensitivity of trajectories (or solutions) to changes in initial states and inputs of the system. For large networks, computing this sensitivity with precision guarantees is c...
متن کاملOn the relationship between logarithmic sensitivity integrals and limiting optimal control problems
Two seemingly independent streams of control systems research have examined logarithmic sensitivity integrals and limiting linear quadratic optimal control problems. These apparently diverse problems yield some results with an identical right hand side. The main contribution of this paper is to directly explain the commonality between these streams. This explanation involves the use of Parseval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004